The Influence of Defeated Arguments in Defeasible Argumentation
نویسنده
چکیده
Formal defeasible argumentation is currently the subject of active research. Formalisms of defeasible argumentation are characterized by a notion of defeasible argument. The influence of arguments on which conclusions can be drawn distinguishes formalisms of defeasible argumentation from nonmonotonic logics. This influence occurs for two reasons: by the structure of an argument, and by interaction with other arguments. In the process of argumentation not all arguments are available at once. At each stage of argumentation new arguments are taken into account. In defeasible argumentation, where arguments can be defeated by other arguments, this results in the possible change of the status of arguments, depending on which arguments have been considered. Existing formalisms of defeasible argumentation do not provide a process view on argumentation, or overlook the influence on this process of the defeated arguments that have been taken into account. In this paper we argue that a model of the process of argumentation requires that the arguments that are defeated at some stage of argumentation cannot simply be ignored. Otherwise, different stages of argumentation cannot be distinguished, and orders of argumentation can disappear.
منابع مشابه
Accrual of arguments in defeasible argumentation
In this paper we address an often overlooked problem in defeasible argumentation: how do we deal with arguments that are on their own defeated, but together remain undefeated? Pollock (1991) finds this accrual of arguments a natural supposition, but then surprisingly denies its existence. We think that arguments do accrue. To handle the accrual of arguments, we introduce compound defeat of argu...
متن کاملFrom systems for defeasible argumentation to dialogical systems of argumentation
Nonmonotonic reasoning is a reasoning in which temporary conclusions can be drawn on the basis of incomplete information but which might be withdrawn when more information becomes available. Systems for defeasible argumentation capture this kind of reasoning in terms of interactions between conflictual arguments. Nonmonotonic reasoning is explained in terms of defeasibility since arguments can ...
متن کاملDefeasible Logic Programming: An Argumentative Approach
The work reported here introduces Defeasible Logic Programming (DeLP), a formalism that combines results of Logic Programming and Defeasible Argumentation. DeLP provides the possibility of representing information in the form of weak rules in a declarative manner, and a defeasible argumentation inference mechanism for warranting the entailed conclusions. In DeLP an argumentation formalism will ...
متن کاملOn resolving Conflicts between Arguments
Argument systems are based on the idea that one can construct arguments for propositions structured reasons justifying the belief in a proposition. Using defeasible rules, arguments need not be valid in all circumstances, therefore, it might be possible to construct an argument for a proposition as well as its negation. When arguments support conflicting propositions, one of the arguments must ...
متن کاملMultiagent argumentation for cooperative planning in DeLP-POP
This contribution proposes a model for argumentation-based multi-agent planning, with a focus on cooperative scenarios. It consists in a multi-agent extension of DeLP-POP, partial order planning on top of argumentation-based defeasible logic programming. In DeLP-POP, actions and arguments (combinations of rules and facts) may be used to enforce some goal, if their conditions (are known to) appl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995